Strongly Regular Integral Circulant Graphs and Their Energies
نویسندگان
چکیده
Let S ⊂ Zn be a finite cyclic group of order n > 1. Assume that 0 / ∈ S and −S = {−s : s ∈ S} = S. The circulant graph G = Cir(n, S) is the undirected graph having the vertex set V (G) = Zn and edge set E(G) = {ab : a, b ∈ Zn, a− b ∈ S}. Let D be a set of positive, proper divisors of the integer n. We characterize certain strongly regular integral circulant graphs with energy 2n(1− 1/d) for a fixed d ∈ D , d > 1.
منابع مشابه
New results on the energy of integral circulant graphs
Circulant graphs are an important class of interconnection networks in parallel and distributed computing. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer as well. The integral circulant graph ICGn(D) has the vertex set Zn = {0, 1, 2, . . . , n− 1} and vertices a and b are adjacent if gcd(a− b, n) ∈ D, where D ⊆ {d : d | n...
متن کاملParameters of Integral Circulant Graphs and Periodic Quantum Dynamics
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system whose hamiltonian is identical to the adjacency matrix of a circulant graph is periodic if and only if all eigenvalues of the graph are integers (that is, the graph is integral). Motivated by this observation, we focus...
متن کاملPerfect state transfer, integral circulants, and join of graphs
We propose new families of graphs which exhibit quantum perfect state transfer. Our constructions are based on the join operator on graphs, its circulant generalizations, and the Cartesian product of graphs. We build upon the results of Bašić and Petković (Applied Mathematics Letters 22(10):1609-1615, 2009) and construct new integral circulants and regular graphs with perfect state transfer. Mo...
متن کاملOn chromatic number of Latin square graphs
The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Although Latin square graphs have been widely studied as strongly regular graphs, their chromatic numbers appear to be unexplored. We determine the chromatic number of a circulant Latin square, and find bounds for some ...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011